An Interactive Clustering Methodology for High Dimensional Data Mining

نویسندگان

  • Haibo Wang
  • Bahram Alidaee
  • Fred Glover
  • Gary A. Kochenberger
چکیده

This study develops an interactive clustering model and methodology for high dimensional data. The similarity index is calculated with proposed formulation for both continuous-scaled and nominal-scaled attributes. The associated similarity score values are constructed into a graph as clique partitioning problem, which can be reformulated into a form of unconstrained quadratic program model and then solved by a Tabu search heuristic incorporating strategic oscillation with a critical event memory. The complexities of high dimensional data mining are discussed from both mathematical modeling and computational algorithm points of view.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High-Dimensional Unsupervised Active Learning Method

In this work, a hierarchical ensemble of projected clustering algorithm for high-dimensional data is proposed. The basic concept of the algorithm is based on the active learning method (ALM) which is a fuzzy learning scheme, inspired by some behavioral features of human brain functionality. High-dimensional unsupervised active learning method (HUALM) is a clustering algorithm which blurs the da...

متن کامل

Visual Interactive Neighborhood Mining on High Dimensional Data

Cluster analysis is widely used for explorative data analysis, however, it is not trivial to select the right method and optimal parameters. Moreover, not all clustering methods can work with raw or dirty data. In this paper, we introduce an interactive data exploration tool, VINeM, which combines interactive mining with unsupervised tools by exploiting an intuitive neighborhood-based visualiza...

متن کامل

Towards Interactive Clustering on Parallel Environment

Clustering is one of the major data mining applications. An obvious characteristic of data mining distinguished from traditional data processing is that the conclusion of data mining cannot be predicted. Data mining is a multi-step process, and user must be allowed to be the front and the center in this process, especially clustering mining method. In this paper, the necessity of interactive da...

متن کامل

An Improved SSPCO Optimization Algorithm for Solve of the Clustering Problem

Swarm Intelligence (SI) is an innovative artificial intelligence technique for solving complex optimization problems. Data clustering is the process of grouping data into a number of clusters. The goal of data clustering is to make the data in the same cluster share a high degree of similarity while being very dissimilar to data from other clusters. Clustering algorithms have been applied to a ...

متن کامل

Interactive Subspace Clustering for Mining High-Dimensional Spatial Patterns

The unprecedented large size and high dimensionality of existing geographic datasets make complex patterns that potentially lurk in the data hard to find. Spatial data analysis capabilities currently available have not kept up with the need for deriving the full potential of these data. “Traditional spatial analytical techniques cannot easily discover new and unexpected patterns, trends and rel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004